A counterexample to a conjecture of Schwartz
نویسندگان
چکیده
In 1990, motivated by applications in the social sciences, Thomas Schwartz made a conjecture about tournaments which would have had numerous attractive consequences. In particular, it implied that there is no tournament with a partition A,B of its vertex set, such that every transitive subset of A is in the out-neighbour set of some vertex in B, and vice versa. But in fact there is such a tournament, as we show in this paper, and so Schwartz’ conjecture is false. Our proof is non-constructive and uses the probabilistic method.
منابع مشابه
On the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملWhen Does Schwartz Conjecture Hold?
In 1990, Thomas Schwartz proposed the conjecture that every nonempty tournament has a unique minimal τ -retentive set (τ stands for tournament equilibrium set). A weak variant of Schwartz’s Conjecture was recently proposed by Felix Brandt. However, both conjectures were disproved very recently by two counterexamples. In this paper, we prove sufficient conditions for infinite classes of tourname...
متن کاملA 64-Dimensional Counterexample to Borsuk's Conjecture
Bondarenko’s 65-dimensional counterexample to Borsuk’s conjecture contains a 64-dimensional counterexample. It is a two-distance set of 352 points.
متن کاملA polynomial counterexample to the Markus-Yamabe Conjecture
We give a polynomial counterexample to both the Markus-Yamabe Conjecture and the discrete Markus-Yamabe problem for all dimensions ≥ 3.
متن کاملOn a Coloring Conjecture of Hajós
Hajós conjectured that graphs containing no subdivision of K5 are 4-colorable. It is shown in [15] that if there is a counterexample to this conjecture then any minimum such counterexample must be 4-connected. In this paper, we further show that if G is a minimum counterexample to Hajós’ conjecture and S is a 4-cut in G then G− S has exactly two components. AMS Subject Classification: 05C15, 05...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 40 شماره
صفحات -
تاریخ انتشار 2013